On the Nonlinear Convexity Theorem of Kostant

نویسندگان

  • JIANG-HUA LU
  • TUDOR RATIU
چکیده

A classical result of Schur and Horn [Sc, Ho] states that the set of diagonal elements of all n x n Hermitian matrices with fixed eigenvalues is a convex set in IRn. Kostant [Kt] has generalized this result to the case of any semisimple Lie group. This is often referred to as the linear convexity theorem of Kostant: picking up the diagonal of a Hermitian matrix is a linear operation. This result was later put into the framework of symplectic geometry by Atiyah [Ay] , Guillemin-Sternberg [Gu-St] and Duistermaat [Du1], the key argument being that the map that picks up the diagonal of a Hermitian matrix is a moment map for a Hamiltonian torus action and that the image of such a moment map is always a convex polytope. There is also a nonlinear version of the convexity theorem of Kostant. It has not been connected so far with symplectic geometry. The purpose of this paper is to make this connection. We first describe the nonlinear convexity theorem for the case of SL(n, q (see §2 for more details). The Gram-Schmidt orthonormalization process in linear algebra asserts that every nonsingular n x n complex matrix g can be uniquely written as the product g = kan for some unitary matrix k, positive diagonal matrix a, and strictly upper-triangular matrix n. We use A to denote the group of all positive diagonal matrices, and we call the matrix a in the above decomposition the A-component of g. The nonlinear convexity theorem of Kostant now asserts that the set of A-components of g as g runs through all positive definite Hermitian matrices with fixed eigenvalues a = (aJ ' ••• , an) is the convex hull of the set of all points obtained by permuting the coordinates of a. Here we identify A with its Lie algebra a via the exponential map; thus convexity in A makes sense. For a general semisimple Lie group G, the Gram-Schmidt decomposition is replaced by an Iwasawa decomposition G = KAN of G, and the permutation group that appeared above is replaced by the Weyl group W of (K, A). If an element g EGis written as the product g = kan for k E K, a E A,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...

متن کامل

Lie-poisson Structure on Some Poisson Lie Groups

Poisson Lie groups appeared in the work of Drinfel'd (see, e.g., [Drl, Dr2]) as classical objects corresponding to quantum groups. Going in the other direction, we may say that a Poisson Lie group is a group of symmetries of a phase space that are allowed to "twist," in a certain sense, the symplectic or Poisson structure. The Poisson structure on the group controls this twisting in a precise w...

متن کامل

The starlikeness, convexity, covering theorem and extreme points of p-harmonic mappings

The main aim of this paper is to introduce three classes $H^0_{p,q}$, $H^1_{p,q}$ and $TH^*_p$ of $p$-harmonic mappings and discuss the properties of mappings in these classes. First, we discuss the starlikeness and convexity of mappings in $H^0_{p,q}$ and $H^1_{p,q}$. Then establish the covering theorem for mappings in $H^1_{p,q}$. Finally, we determine the extreme points of the class $TH^*_{p}$.

متن کامل

A Microscopic Convexity Principle for Nonlinear Partial Differential Equations

Caffarelli-Friedman [7] proved a constant rank theorem for convex solutions of semilinear elliptic equations in R2, a similar result was also discovered by Yau [28] at the same time. The result in [7] was generalized to R by Korevaar-Lewis [27] shortly after. This type of constant rank theorem is called microscopic convexity principle. It is a powerful tool in the study of geometric properties ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009